Synthesis of Function-Described Graphs
نویسندگان
چکیده
Abst rac t . Function-described graphs (FDGs) have been introduced very recently as a representation of an ensemble of attributed relational graphs (ARGs) for structural pattern recogrfition [1, 2]. In this paper, the relationship between FDGs and Random Graphs [3] is analysed and the synthesis process of FDGs is studied, whereas the matching process between FDGs and ARGs is discussed elsewhere [4]. Two procedures are described to synthesize an FDG from a set of commonly labelled ARGs or FDGs, respectively. Then, a general incremental method to synthesize an FDG from a sequence of unlabelled ARGs is proposed. Specific methods are obtained when an ARG-to-FDG matching algorithm is selected to find optimal morphisms.
منابع مشابه
ATTEMPTED SYNTHESIS OF QUINONEMETHINE DERIVATIVE OF NOCARDICIN A ANALOGUES
The synthesis of some 13-lactams is described. 'The electronic activation of monocyclic B-lactams provided by a quinonemethine function was found to instabilize the 13-lactam ring toward nucleophilic: attack by water
متن کاملSynthesis of Function - Described
Function-described graphs (FDGs) have been introduced very recently as a representation of an ensemble of attributed relational graphs (ARGs) for structural pattern recognition 1, 2]. In this paper, the relationship between FDGs and Random Graphs 3] is analysed and the synthesis process of FDGs is studied, whereas the matching process between FDGs and ARGs is discussed elsewhere 4]. Two procedu...
متن کاملClustering of Attributed Graphs and Unsupervised Synthesis of Function-Described Graphs
Function-Described Graphs (FDGs) have been introduced by the authors as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition alternative to first-order random graphs. Both optimal and approximate algorithms for error-tolerant graph matching, which use a distance measure between AGs and FDGs, have been reported elsewhere. Also, the supervised synthesis of...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کامل